q-Analog of tableau containment

نویسنده

  • Jang Soo Kim
چکیده

We prove a q-analog, which is valid if q is a positive real number, of the following: the probability that, when n tends to infinity, a randomly chosen standard Young tableau of size n contains a fixed standard Young tableau of shape λ ⊢ k is equal to f λ k! (Journal of Combinatorial Theory Series A, volume 97, 117–128, 2002). We also consider pairs of tableaux.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analog of Schensted's Algorithm for Shifted Young Tableaux

For example “i” is a YT of shape (4, 3, 1). The YT is said to be standard (an SYT) if the integers in the tableau are 1, 2,..., n as in “. A partition p = (pl, p2 ,..., pt) is strict if p1 > t+ > ... > pt > 0. A generalized Shzyted Young Tableau (abbreviated ST) of shape p is an array of n-integers into t rows with row i containing pi integers and indented i 1 spaces, such that the rows are non...

متن کامل

Tableau Cycling and Catalan Numbers

We develop two combinatorial proofs of the fact that certain Young tableaux are counted by the Catalan numbers. The setting is a larger class of tableaux where labels increase along rows without attention to whether labels increase down columns. We define a new operation called tableau cycling. It is used to duplicate the reflection argument attributed to André in the tableaux setting, and also...

متن کامل

Towards Graph Containment Search and Indexing

Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g ∈ D such that q contains g (q ⊇ g). Due to the wide adoption of graph models, fast containment search of graph data finds many applications in various domains. In comparison to traditional graph search that retrieves all the graphs containing q (q ⊆ g), containment search has its own indexing c...

متن کامل

5 F eb 2 00 6 PATHS , TABLEAUX , AND q - CHARACTERS OF QUANTUM AFFINE ALGEBRAS : THE C n CASE

For the quantum affine algebra Uq(ĝ) with g of classical type, let χλ/μ,a be the Jacobi-Trudi type determinant for the generating series of the (supposed) q-characters of the fundamental representations. We conjecture that χλ/μ,a is the q-character of a certain finite dimensional representation of Uq(ĝ). We study the tableaux description of χλ/μ,a using the path method due to Gessel-Viennot. It...

متن کامل

A Symmetry Theorem on a Modified Jeu De Taquin

For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli, Pak and Stoyanovskii [2] define a modified jeu de taquin which transforms an arbitrary filling of the Ferrers diagram with 1, 2, . . . , n (tabloid) into a standard tableau. Their definition relies on a total order of the cells in the Ferrers diagram induced by a special standard t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 118  شماره 

صفحات  -

تاریخ انتشار 2011